Rewriting Induction + Linear Arithmetic = Decision Procedure
نویسندگان
چکیده
This paper presents new results on the decidability of inductive validity of conjectures. For this, a class of term rewrite systems (TRSs) with built-in linear integer arithmetic is introduced and it is shown how these TRSs can be used in the context of inductive theorem proving. The proof method developed for this couples (implicit) inductive reasoning with a decision procedure for the theory of linear integer arithmetic with (free) constructors. The effectiveness of the new decidability results on a large class of conjectures is demonstrated by an evaluation of the prototype implementation Sail2.
منابع مشابه
Tecton Proof System
The Tecton Proof System is an experimental tool for constructing proofs of rst order logic formulas and of program speciications expressed using formulas in Hoare's axiomatic proof formalism. It is designed to make interactive proof construction easier than with previous proof tools, by maintaining multiple proof attempts internally in a structured form called a proof forest; displaying them in...
متن کاملValidity Checking for Combinations of Theories with Equality
An essential component in many veriication methods is a fast decision procedure for validating logical expressions. This paper presents the algorithm used in the Stanford Validity Checker (SVC) which has been used to aid several realistic hardware veriication efforts. The logic for this decision procedure includes Boolean and un-interpreted functions and linear arithmetic. We have also successf...
متن کاملComputer Arithmetic: Logic, Calculation, and Rewriting
Computer arithmetic is the logical theory which formalizes the way computers manipulate integer numbers. In this paper, we describe a combined system whose components are a logical theory for the Isabelle theorem prover, a calculational engine based on rewriting techniques, and a decision procedure for an extension of quantiier-free Presburger arithmetic. The goal of this work is to provide a g...
متن کاملA Theorem Prover for a Computational Logic
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, known both as NQTHM and as the Boyer-Moore prover, contains a mechanized principle of induction and implementations of linear resolution, rewriting, and arithmetic decision procedures. We describe some applications of th...
متن کاملIntegrating Decision Procedures in Reflective Rewriting-Based Theorem Provers ?
We propose a design for the integration of decision procedures in reflective rewritingbased equational theorem provers. Rewriting-based equational theorem provers use term rewriting as their basic proof engine; they are particularly well suited for proving properties of equational specifications. A reflective rewriting-based theorem prover is itself an executable equational specification, which...
متن کامل